An Algorithm for Simultaneous Band Reduction of Two Dense Symmetric Matrices
نویسندگان
چکیده
In this paper, we propose an algorithm for simultaneously reducing two dense symmetric matrices to band form with the same bandwidth by congruent transformations. The simultaneous band reduction can be considered as an extension of the simultaneous tridiagonalization of two dense symmetric matrices. In contrast to algorithms of simultaneous tridiagonalization that are based on Level-2 BLAS (Basic Linear Algebra Subroutine) operations, our band reduction algorithm is devised to take full advantage of Level-3 BLAS operations for better performance. Numerical results are presented to illustrate the effectiveness of our algorithm.
منابع مشابه
Computing the rank revealing factorization of symmetric matrices by the semiseparable reduction
An algorithm for reducing a symmetric dense matrix into a symmetric semiseparable one by orthogonal similarity transformations and an efficient implementation of the QR–method for symmetric semiseparable matrices have been recently proposed. In this paper, exploiting the properties of the latter algorithms, an algorithm for computing the rank revealing factorization of symmetric matrices is con...
متن کامل3D Classification of Urban Features Based on Integration of Structural and Spectral Information from UAV Imagery
Three-dimensional classification of urban features is one of the important tools for urban management and the basis of many analyzes in photogrammetry and remote sensing. Therefore, it is applied in many applications such as planning, urban management and disaster management. In this study, dense point clouds extracted from dense image matching is applied for classification in urban areas. Appl...
متن کاملAlgorithm 8xx: PIRO BAND, Pipelined Plane Rotations for Blocked Band Reduction
PIRO BAND is a library for bidiagonal reduction of unsymmetric banded matrices and tridiagonal reduction of symmetric banded matrices. It supports both real and complex matrices stored in packed band format. The software also can handle single and double precision arithmetic with 32-bit and 64-bit integers. We provide both a C library and MATLAB callable interfaces. The library is about 2 to 7 ...
متن کاملA Parallel Bisection and Inverse Iteration Solver for a Subset of Eigenpairs of Symmetric Band Matrices
The tridiagonalization and its back-transformation for computing eigenpairs of real symmetric dense matrices are known to be the bottleneck of the execution time in parallel processing owing to the communication cost and the number of floating-point operations. To overcome this problem, we focus on real symmetric band eigensolvers proposed by Gupta and Murata since their eigensolvers are compos...
متن کاملToward High Performance Divide and Conquer Eigensolver for Dense Symmetric Matrices
This paper presents a high performance eigensolver for dense symmetric matrices on multicore architectures. Based on the well-known divide and conquer (D&C) methodology introduced by Cuppen, this algorithm computes all the eigenvalues of the symmetric matrix. The general D&C can be expressed in three stages: (1) Partitioning into subproblems, (2) Computing the solution of the subproblems and (3...
متن کامل